Strongly Optimal Policies in Sequential Search with Random Overlook Probabilities

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal sequential inspection policies

We consider the problem of combining a given set of diagnostic tests into an inspection system that can classify items of interest (cases) with maximum accuracy subject to budget constraints. One motivating application is sequencing diagnostic tests for container inspection problems, where the diagnostic tests may correspond to radiation sensors, documents checks, or imaging systems. We conside...

متن کامل

Optimal dividend policies with random profitability∗

We study an optimal dividend problem under a bankruptcy constraint. Firms face a trade-off between potential bankruptcy and extraction of profits. In contrast to previous works, general cash flow drifts, including Ornstein–Uhlenbeck and CIR processes, are considered. We provide rigorous proofs of continuity of the value function, whence dynamic programming, as well as uniqueness of the solution...

متن کامل

OPTIMAL DESIGN OF DIAGRID MODULES BY PSEUDO RANDOM DIRECTIONAL SEARCH

The present work reveals a problem formulation to minimize material consumption and improve efficiency of diagrids to resist equivalent wind loading. The integrated formulation includes not only sizing of structural members but also variation in geometry and topology of such a system. Particular encoding technique is offered to handle practical variation of diagrid modules. A variant of Pseudo-...

متن کامل

ROMA: Random Overlook Mastering ATFM

Consider the arrival process defined by t i =i + ξ i , where ξ i are i.i.d random variables. First introduced in the 50's, this arrival process is of remarkable importance in Air Traffic Flow Management and other transportation systems, where scheduled arrivals are intrinsically subject to random variations; other frameworks where this model has proved to be capable of a good description of act...

متن کامل

Optimal Adaptive Policies for Sequential Allocation Problems

p Ž . 0 Ž . Ž . Ž . V u under any policy p in C is equal to nm* u y M u log n q o log n , as n R Ž . Ž . Ž . n a `, where m* u is the largest population mean and M u is a constant. ii Policies in C are asymptotically optimal within a larger class C of ‘‘uniformly R UF 0 p Ž Ž . Ž .. fast convergent’’ policies in the sense that limna ` nm* u y V u r n Ž Ž . pŽ .. Ž . nm* u y V u F 1, for any p g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 1977

ISSN: 0090-5364

DOI: 10.1214/aos/1176343745